A Constraint-based Morphological Analyzer for Concatenative and Non-concatenative Morphology
نویسندگان
چکیده
Morphological analysis in the current methods, such as finite-state and unification-based, are predominantly effective for handling concatenative morphology (e.g. prefixation and suffixation), although some of these techniques can also handle limited non-concatenative phenomena (e.g. infixation and partial and full-stem reduplication). A constraint-based method to perform morphological analysis that handles both concatenative and non-concatenative morphological phenomena is presented, based on the optimality theory framework and the two-level morphology rule representation. Although optimality theory has been proven effective in handling non-concatenative phenomena, it has been applied for the generation process, and in this study, it has been shown to be effective also in morphological analysis. The method was tested on 1,600 Tagalog verb forms (having 3 to 7 syllables) from 50 Tagalog roots which exhibit both concatenative and non-concatenative morphology. The resulting method is able to produce the correct underlying forms of the surface forms of 96% of the test data, having a 4% error, which is attributed to d-r alternation.
منابع مشابه
Finite-State Non-Concatenative Morphotactics
Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators, including many large-scale commercial systems. However, it has long been recognized that these implementations have serious limitations in handling non-concatenative phenomena. We describe a new technique for constr...
متن کاملNON-C ONCATENATIVE DERIVATION Other Processes
This chapter provides an overview of a wide range of non-concatenative (nonreduplicative) phenomena in morphology focusing on a typological categorization.1 The definition of non-concatenative morphology is not uncontroversial. Kurisu (2001: 2) considers non-concatenative morphology to be observed in cases where the phonological instantiation of a morpheme cannot be demarcated in an output repr...
متن کاملFinite-State Phonology Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology
Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators, including many large-scale commercial systems. However, it has long been recognized that these implementations have serious limitations in handling non-concatenative phenomena. We describe a new technique for constr...
متن کاملEvaluating Sequence Alignment for Learning Inflectional Morphology
This work examines CRF-based sequence alignment models for learning natural language morphology. Although these systems have performed well for a limited number of languages, this work, as part of the SIGMORPHON 2016 shared task, specifically sets out to determine whether these models handle non-concatenative morphology as well as previous work might suggest. Results, however, indicate a strong...
متن کاملProsodic Inheritance And Morphological Generalisations
Prosodic Inheritance (PI) morphology provides uniform treatment of both concatenative and non-concatenative morphological and phonological generalisations using default inheritance. Models of an extensive range of German Umlaut and Arabic intercalation facts, implemented in DATR, show that the PI approach also covers 'hard cases' more homogeneously and more extensively than previous computation...
متن کامل